0.08/0.13 % Problem : SLH552^1 : TPTP v7.5.0. Released v7.5.0. 0.08/0.14 % Command : run_E %s %d THM 0.14/0.36 % Computer : n020.cluster.edu 0.14/0.36 % Model : x86_64 x86_64 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.14/0.36 % Memory : 8042.1875MB 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64 0.14/0.36 % CPULimit : 30 0.14/0.36 % WCLimit : 30 0.14/0.36 % DateTime : Tue Aug 9 03:13:05 EDT 2022 0.14/0.36 % CPUTime : 0.22/0.50 The problem SPC is TH0_THM_EQU_NAR 0.22/0.50 Running higher-order on 1 cores theorem proving 0.22/0.50 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=1 --cpu-limit=30 /export/starexec/sandbox/benchmark/theBenchmark.p 0.22/0.50 # Version: 3.0pre003-ho 2.63/2.87 # partial match(1): HSLSSMSSSSSNSFA 2.63/2.87 # Preprocessing class: HSLSSLSSSSSNSFA. 2.63/2.87 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 2.63/2.87 # Starting new_ho_11 with 30s (1) cores 2.63/2.87 # new_ho_11 with pid 11621 completed with status 0 2.63/2.87 # Result found by new_ho_11 2.63/2.87 # partial match(1): HSLSSMSSSSSNSFA 2.63/2.87 # Preprocessing class: HSLSSLSSSSSNSFA. 2.63/2.87 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 2.63/2.87 # Starting new_ho_11 with 30s (1) cores 2.63/2.87 # No SInE strategy applied 2.63/2.87 # Search class: HGHSM-FSLS31-MSFFFSBN 2.63/2.87 # Scheduled 5 strats onto 1 cores with 30 seconds (30 total) 2.63/2.87 # Starting new_ho_10 with 17s (1) cores 2.63/2.87 # new_ho_10 with pid 11622 completed with status 0 2.63/2.87 # Result found by new_ho_10 2.63/2.87 # partial match(1): HSLSSMSSSSSNSFA 2.63/2.87 # Preprocessing class: HSLSSLSSSSSNSFA. 2.63/2.87 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 2.63/2.87 # Starting new_ho_11 with 30s (1) cores 2.63/2.87 # No SInE strategy applied 2.63/2.87 # Search class: HGHSM-FSLS31-MSFFFSBN 2.63/2.87 # Scheduled 5 strats onto 1 cores with 30 seconds (30 total) 2.63/2.87 # Starting new_ho_10 with 17s (1) cores 2.63/2.87 # Preprocessing time : 0.007 s 2.63/2.87 # Presaturation interreduction done 2.63/2.87 2.63/2.87 # Proof found! 2.63/2.87 # SZS status Theorem 2.63/2.87 # SZS output start CNFRefutation 2.63/2.87 thf(decl_22, type, finite_finite_set_a: set_set_a > $o). 2.63/2.87 thf(decl_23, type, finite_finite_a: set_a > $o). 2.63/2.87 thf(decl_24, type, minus_1444187941_set_a: set_set_a > set_set_a > set_set_a). 2.63/2.87 thf(decl_25, type, minus_minus_set_a: set_a > set_a > set_a). 2.63/2.87 thf(decl_26, type, inf_inf_a_o: (a > $o) > (a > $o) > a > $o). 2.63/2.87 thf(decl_27, type, inf_inf_set_a: set_a > set_a > set_a). 2.63/2.87 thf(decl_28, type, sup_sup_a_o: (a > $o) > (a > $o) > a > $o). 2.63/2.87 thf(decl_29, type, sup_sup_set_set_a: set_set_a > set_set_a > set_set_a). 2.63/2.87 thf(decl_30, type, sup_sup_set_a: set_a > set_a > set_a). 2.63/2.87 thf(decl_31, type, lattic1600076923_set_a: set_set_a > set_a). 2.63/2.87 thf(decl_32, type, lattic501550101_set_a: set_set_a > set_a). 2.63/2.87 thf(decl_33, type, bot_bot_a_o: a > $o). 2.63/2.87 thf(decl_34, type, bot_bot_o: $o). 2.63/2.87 thf(decl_35, type, bot_bot_set_set_a: set_set_a). 2.63/2.87 thf(decl_36, type, bot_bot_set_a: set_a). 2.63/2.87 thf(decl_37, type, ord_less_eq_a_o: (a > $o) > (a > $o) > $o). 2.63/2.87 thf(decl_38, type, ord_le318720350_set_a: set_set_a > set_set_a > $o). 2.63/2.87 thf(decl_39, type, ord_less_eq_set_a: set_a > set_a > $o). 2.63/2.87 thf(decl_40, type, collect_a: (a > $o) > set_a). 2.63/2.87 thf(decl_41, type, insert_set_a: set_a > set_set_a > set_set_a). 2.63/2.87 thf(decl_42, type, insert_a: a > set_a > set_a). 2.63/2.87 thf(decl_43, type, is_empty_a: set_a > $o). 2.63/2.87 thf(decl_44, type, is_singleton_a: set_a > $o). 2.63/2.87 thf(decl_45, type, remove_a: a > set_a > set_a). 2.63/2.87 thf(decl_46, type, the_elem_a: set_a > a). 2.63/2.87 thf(decl_47, type, member_set_a: set_a > set_set_a > $o). 2.63/2.87 thf(decl_48, type, member_a: a > set_a > $o). 2.63/2.87 thf(decl_49, type, f: set_a). 2.63/2.87 thf(decl_50, type, p: $o). 2.63/2.87 thf(decl_51, type, esk1_1: set_a > set_a). 2.63/2.87 thf(decl_52, type, esk2_1: set_a > a). 2.63/2.87 thf(decl_53, type, esk3_1: set_a > set_a). 2.63/2.87 thf(decl_54, type, esk4_1: set_a > a). 2.63/2.87 thf(decl_55, type, esk5_2: set_a > (set_a > $o) > a). 2.63/2.87 thf(decl_56, type, esk6_2: set_a > (set_a > $o) > set_a). 2.63/2.87 thf(decl_57, type, esk7_2: set_a > (set_a > $o) > set_a). 2.63/2.87 thf(decl_58, type, esk8_2: set_a > (set_a > $o) > a). 2.63/2.87 thf(decl_59, type, esk9_2: set_a > (set_a > $o) > a). 2.63/2.87 thf(decl_60, type, esk10_2: set_a > (set_a > $o) > a). 2.63/2.87 thf(decl_61, type, esk11_2: set_a > (set_a > $o) > set_a). 2.63/2.87 thf(decl_62, type, esk12_1: (set_a > $o) > set_a). 2.63/2.87 thf(decl_63, type, esk13_1: (set_a > $o) > a). 2.63/2.87 thf(decl_64, type, esk14_1: (set_a > $o) > set_a). 2.63/2.87 thf(decl_65, type, esk15_1: (a > $o) > a). 2.63/2.87 thf(decl_66, type, esk16_1: (a > $o) > a). 2.63/2.87 thf(decl_67, type, esk17_1: set_a > a). 2.63/2.87 thf(decl_68, type, esk18_1: set_a > a). 2.63/2.87 thf(decl_69, type, esk19_1: set_a > a). 2.63/2.87 thf(decl_70, type, esk20_2: a > set_a > set_a). 2.63/2.87 thf(decl_71, type, esk21_4: a > set_a > a > set_a > set_a). 2.63/2.87 thf(decl_72, type, esk22_2: a > set_a > set_a). 2.63/2.87 thf(decl_73, type, esk23_1: set_a > a). 2.63/2.87 thf(decl_74, type, esk24_1: set_a > a). 2.63/2.87 thf(decl_75, type, esk25_2: (a > $o) > (a > $o) > a). 2.63/2.87 thf(decl_76, type, esk26_3: set_a > set_a > (set_a > $o) > a). 2.63/2.87 thf(decl_77, type, esk27_3: set_a > set_a > (set_a > $o) > set_a). 2.63/2.87 thf(decl_78, type, esk28_3: set_a > set_a > (set_a > $o) > a). 2.63/2.87 thf(decl_79, type, esk29_3: set_a > set_a > (set_a > $o) > set_a). 2.63/2.87 thf(decl_80, type, esk30_2: set_a > (set_a > $o) > a). 2.63/2.87 thf(decl_81, type, esk31_2: set_a > (set_a > $o) > set_a). 2.63/2.87 thf(decl_82, type, esk32_2: (set_a > $o) > set_a > set_a). 2.63/2.87 thf(decl_83, type, esk33_2: set_a > set_a > a). 2.63/2.87 thf(decl_84, type, esk34_2: set_a > set_a > a). 2.63/2.87 thf(decl_85, type, esk35_2: set_a > set_a > a). 2.63/2.87 thf(decl_86, type, esk36_2: (a > $o) > (a > $o) > a). 2.63/2.87 thf(decl_87, type, esk37_2: (a > $o) > (a > $o) > a). 2.63/2.87 thf(decl_88, type, esk38_4: set_a > set_a > (set_a > set_a) > set_a > set_a). 2.63/2.87 thf(decl_89, type, esk39_4: set_a > set_a > (set_a > set_a) > set_a > set_a). 2.63/2.87 thf(decl_90, type, esk40_4: set_a > (set_a > set_a) > set_a > set_a > set_a). 2.63/2.87 thf(decl_91, type, esk41_4: set_a > (set_a > set_a) > set_a > set_a > set_a). 2.63/2.87 thf(decl_92, type, esk42_4: set_a > set_a > (set_a > set_a) > set_a > set_a). 2.63/2.87 thf(decl_93, type, esk43_4: set_a > set_a > (set_a > set_a) > set_a > set_a). 2.63/2.87 thf(decl_94, type, esk44_4: set_a > (set_a > set_a) > set_a > set_a > set_a). 2.63/2.87 thf(decl_95, type, esk45_4: set_a > (set_a > set_a) > set_a > set_a > set_a). 2.63/2.87 thf(decl_96, type, esk46_2: set_set_a > set_a > set_a). 2.63/2.87 thf(decl_97, type, esk47_2: set_set_a > set_a > set_a). 2.63/2.87 thf(decl_98, type, esk48_2: (set_a > $o) > set_a > set_a). 2.63/2.87 thf(decl_99, type, esk49_2: set_a > (set_a > $o) > set_a). 2.63/2.87 thf(decl_100, type, esk50_1: set_set_a > set_a). 2.63/2.87 thf(decl_101, type, esk51_1: set_set_a > set_a). 2.63/2.87 thf(decl_102, type, esk52_1: set_a > a). 2.63/2.87 thf(decl_103, type, esk53_1: set_a > a). 2.63/2.87 thf(decl_104, type, esk54_1: set_a > a). 2.63/2.87 thf(decl_105, type, esk55_2: set_set_a > set_a > set_a). 2.63/2.87 thf(decl_106, type, esk56_2: set_set_a > set_a > set_a). 2.63/2.87 thf(decl_107, type, esk57_2: set_set_a > set_a > set_a). 2.63/2.87 thf(decl_108, type, esk58_2: set_set_a > set_a > set_a). 2.63/2.87 thf(decl_109, type, epred1_1: set_a > a > $o). 2.63/2.87 thf(decl_110, type, esk59_2: (a > $o) > (a > $o) > a). 2.63/2.87 thf(decl_111, type, esk60_2: (a > $o) > (a > $o) > a). 2.63/2.87 thf(decl_112, type, esk61_2: (a > $o) > (a > $o) > a). 2.63/2.87 thf(decl_113, type, esk62_2: (a > $o) > (a > $o) > a). 2.63/2.87 thf(conj_2, hypothesis, ![X234:set_a, X36:a]:((((f)=(insert_a @ X36 @ X234))=>(~((member_a @ X36 @ X234))=>((finite_finite_a @ X234)=>(p))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_2)). 2.63/2.87 thf(conj_3, conjecture, (p), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_3)). 2.63/2.87 thf(fact_22_insert__absorb, axiom, ![X1:a, X2:set_a]:(((member_a @ X1 @ X2)=>((insert_a @ X1 @ X2)=(X2)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_22_insert__absorb)). 2.63/2.87 thf(fact_3_finite_Osimps, axiom, ((finite_finite_a)=(^[X6:set_a]:((((X6)=(bot_bot_set_a))|?[X7:set_a, X8:a]:((((X6)=(insert_a @ X8 @ X7))&(finite_finite_a @ X7))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_3_finite_Osimps)). 2.63/2.87 thf(conj_1, hypothesis, (((f)=(bot_bot_set_a))=>(p)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_1)). 2.63/2.87 thf(fact_212_insert__disjoint_I2_J, axiom, ![X1:a, X2:set_a, X14:set_a]:((((bot_bot_set_a)=(inf_inf_set_a @ (insert_a @ X1 @ X2) @ X14))<=>(~((member_a @ X1 @ X14))&((bot_bot_set_a)=(inf_inf_set_a @ X2 @ X14))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_212_insert__disjoint_I2_J)). 2.63/2.87 thf(conj_0, hypothesis, (finite_finite_a @ f), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_0)). 2.63/2.87 thf(fact_216_Diff__disjoint, axiom, ![X2:set_a, X14:set_a]:(((inf_inf_set_a @ X2 @ (minus_minus_set_a @ X14 @ X2))=(bot_bot_set_a))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_216_Diff__disjoint)). 2.63/2.87 thf(fact_123_rev__finite__subset, axiom, ![X14:set_a, X2:set_a]:(((finite_finite_a @ X14)=>((ord_less_eq_set_a @ X2 @ X14)=>(finite_finite_a @ X2)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_123_rev__finite__subset)). 2.63/2.87 thf(fact_127_subset__insertI2, axiom, ![X2:set_a, X14:set_a, X15:a]:(((ord_less_eq_set_a @ X2 @ X14)=>(ord_less_eq_set_a @ X2 @ (insert_a @ X15 @ X14)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_127_subset__insertI2)). 2.63/2.87 thf(fact_185_Un__Diff__cancel, axiom, ![X2:set_a, X14:set_a]:(((sup_sup_set_a @ X2 @ (minus_minus_set_a @ X14 @ X2))=(sup_sup_set_a @ X2 @ X14))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_185_Un__Diff__cancel)). 2.63/2.87 thf(fact_130_Diff__insert, axiom, ![X2:set_a, X1:a, X14:set_a]:(((minus_minus_set_a @ X2 @ (insert_a @ X1 @ X14))=(minus_minus_set_a @ (minus_minus_set_a @ X2 @ X14) @ (insert_a @ X1 @ bot_bot_set_a)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_130_Diff__insert)). 2.63/2.87 thf(fact_173_Un__insert__left, axiom, ![X1:a, X14:set_a, X41:set_a]:(((sup_sup_set_a @ (insert_a @ X1 @ X14) @ X41)=(insert_a @ X1 @ (sup_sup_set_a @ X14 @ X41)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_173_Un__insert__left)). 2.63/2.87 thf(fact_195_sup__bot__left, axiom, ![X13:set_a]:(((sup_sup_set_a @ bot_bot_set_a @ X13)=(X13))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_195_sup__bot__left)). 2.63/2.87 thf(fact_82_Diff__subset, axiom, ![X2:set_a, X14:set_a]:((ord_less_eq_set_a @ (minus_minus_set_a @ X2 @ X14) @ X2)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_82_Diff__subset)). 2.63/2.87 thf(fact_59_Diff__empty, axiom, ![X2:set_a]:(((minus_minus_set_a @ X2 @ bot_bot_set_a)=(X2))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_59_Diff__empty)). 2.63/2.87 thf(c_0_16, hypothesis, ![X234:set_a, X36:a]:((((f)=(insert_a @ X36 @ X234))=>(~(member_a @ X36 @ X234)=>((finite_finite_a @ X234)=>(p))))), inference(fof_simplification,[status(thm)],[conj_2])). 2.63/2.87 thf(c_0_17, hypothesis, ![X1397:set_a, X1398:a]:((((f)!=(insert_a @ X1398 @ X1397))|((member_a @ X1398 @ X1397)|(~(finite_finite_a @ X1397)|(p))))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])). 2.63/2.87 thf(c_0_18, negated_conjecture, ~(p), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_3])])). 2.63/2.87 thf(c_0_19, plain, ![X873:a, X874:set_a]:((~(member_a @ X873 @ X874)|((insert_a @ X873 @ X874)=(X874)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_22_insert__absorb])])). 2.63/2.87 thf(c_0_20, hypothesis, ![X1:a, X2:set_a]:(((member_a @ X1 @ X2)|(p)|((f)!=(insert_a @ X1 @ X2))|~((finite_finite_a @ X2)))), inference(split_conjunct,[status(thm)],[c_0_17])). 2.63/2.87 thf(c_0_21, negated_conjecture, ~((p)), inference(split_conjunct,[status(thm)],[c_0_18])). 2.63/2.87 thf(c_0_22, plain, ![X768:set_a]:(((finite_finite_a @ X768)<=>(((X768)=(bot_bot_set_a))|?[X7:set_a, X8:a]:((((X768)=(insert_a @ X8 @ X7))&(finite_finite_a @ X7)))))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[fact_3_finite_Osimps])])). 2.63/2.87 thf(c_0_23, hypothesis, (((f)!=(bot_bot_set_a))|(p)), inference(fof_nnf,[status(thm)],[conj_1])). 2.63/2.87 thf(c_0_24, plain, ![X1:a, X2:set_a]:((((insert_a @ X1 @ X2)=(X2))|~((member_a @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_19])). 2.63/2.87 thf(c_0_25, hypothesis, ![X1:a, X2:set_a]:(((member_a @ X1 @ X2)|((insert_a @ X1 @ X2)!=(f))|~((finite_finite_a @ X2)))), inference(sr,[status(thm)],[c_0_20, c_0_21])). 2.63/2.87 thf(c_0_26, plain, ![X807:set_a, X810:set_a, X811:set_a, X812:a]:((((((X807)=(insert_a @ (esk4_1 @ X807) @ (esk3_1 @ X807)))|((X807)=(bot_bot_set_a))|~(finite_finite_a @ X807))&((finite_finite_a @ (esk3_1 @ X807))|((X807)=(bot_bot_set_a))|~(finite_finite_a @ X807)))&((((X810)!=(bot_bot_set_a))|(finite_finite_a @ X810))&(((X810)!=(insert_a @ X812 @ X811))|~(finite_finite_a @ X811)|(finite_finite_a @ X810))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])])])])])). 2.63/2.87 thf(c_0_27, hypothesis, ((p)|((f)!=(bot_bot_set_a))), inference(split_conjunct,[status(thm)],[c_0_23])). 2.63/2.87 thf(c_0_28, plain, ![X1:a, X2:set_a, X14:set_a]:((((bot_bot_set_a)=(inf_inf_set_a @ (insert_a @ X1 @ X2) @ X14))<=>(~(member_a @ X1 @ X14)&((bot_bot_set_a)=(inf_inf_set_a @ X2 @ X14))))), inference(fof_simplification,[status(thm)],[fact_212_insert__disjoint_I2_J])). 2.63/2.87 thf(c_0_29, hypothesis, ![X1:a, X2:set_a]:((((f)=(X2))|((insert_a @ X1 @ X2)!=(f))|~((finite_finite_a @ X2)))), inference(local_rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24, c_0_25])])). 2.63/2.87 thf(c_0_30, plain, ![X2:set_a]:((((X2)=(insert_a @ (esk4_1 @ X2) @ (esk3_1 @ X2)))|((X2)=(bot_bot_set_a))|~((finite_finite_a @ X2)))), inference(split_conjunct,[status(thm)],[c_0_26])). 2.63/2.87 thf(c_0_31, hypothesis, (finite_finite_a @ f), inference(split_conjunct,[status(thm)],[conj_0])). 2.63/2.87 thf(c_0_32, hypothesis, ((f)!=(bot_bot_set_a)), inference(sr,[status(thm)],[c_0_27, c_0_21])). 2.63/2.87 thf(c_0_33, plain, ![X1327:a, X1328:set_a, X1329:set_a]:((((~(member_a @ X1327 @ X1329)|((bot_bot_set_a)!=(inf_inf_set_a @ (insert_a @ X1327 @ X1328) @ X1329)))&(((bot_bot_set_a)=(inf_inf_set_a @ X1328 @ X1329))|((bot_bot_set_a)!=(inf_inf_set_a @ (insert_a @ X1327 @ X1328) @ X1329))))&((member_a @ X1327 @ X1329)|((bot_bot_set_a)!=(inf_inf_set_a @ X1328 @ X1329))|((bot_bot_set_a)=(inf_inf_set_a @ (insert_a @ X1327 @ X1328) @ X1329))))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_28])])])). 2.63/2.87 thf(c_0_34, plain, ![X1337:set_a, X1338:set_a]:(((inf_inf_set_a @ X1337 @ (minus_minus_set_a @ X1338 @ X1337))=(bot_bot_set_a))), inference(variable_rename,[status(thm)],[fact_216_Diff__disjoint])). 2.63/2.87 thf(c_0_35, plain, ![X1130:set_a, X1131:set_a]:((~(finite_finite_a @ X1130)|(~(ord_less_eq_set_a @ X1131 @ X1130)|(finite_finite_a @ X1131)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_123_rev__finite__subset])])). 2.63/2.87 thf(c_0_36, plain, ![X1140:set_a, X1141:set_a, X1142:a]:((~(ord_less_eq_set_a @ X1140 @ X1141)|(ord_less_eq_set_a @ X1140 @ (insert_a @ X1142 @ X1141)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_127_subset__insertI2])])). 2.63/2.87 thf(c_0_37, hypothesis, (((esk3_1 @ f)=(f))|~((finite_finite_a @ (esk3_1 @ f)))), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_29, c_0_30])]), c_0_31])]), c_0_32])). 2.63/2.87 thf(c_0_38, plain, ![X2:set_a]:(((finite_finite_a @ (esk3_1 @ X2))|((X2)=(bot_bot_set_a))|~((finite_finite_a @ X2)))), inference(split_conjunct,[status(thm)],[c_0_26])). 2.63/2.87 thf(c_0_39, plain, ![X1:a, X3:set_a, X2:set_a]:((~((member_a @ X1 @ X2))|((bot_bot_set_a)!=(inf_inf_set_a @ (insert_a @ X1 @ X3) @ X2)))), inference(split_conjunct,[status(thm)],[c_0_33])). 2.63/2.87 thf(c_0_40, plain, ![X3:set_a, X2:set_a]:(((inf_inf_set_a @ X2 @ (minus_minus_set_a @ X3 @ X2))=(bot_bot_set_a))), inference(split_conjunct,[status(thm)],[c_0_34])). 2.63/2.87 thf(c_0_41, plain, ![X1279:set_a, X1280:set_a]:(((sup_sup_set_a @ X1279 @ (minus_minus_set_a @ X1280 @ X1279))=(sup_sup_set_a @ X1279 @ X1280))), inference(variable_rename,[status(thm)],[fact_185_Un__Diff__cancel])). 2.63/2.87 thf(c_0_42, plain, ![X1151:set_a, X1152:a, X1153:set_a]:(((minus_minus_set_a @ X1151 @ (insert_a @ X1152 @ X1153))=(minus_minus_set_a @ (minus_minus_set_a @ X1151 @ X1153) @ (insert_a @ X1152 @ bot_bot_set_a)))), inference(variable_rename,[status(thm)],[fact_130_Diff__insert])). 2.63/2.87 thf(c_0_43, plain, ![X1251:a, X1252:set_a, X1253:set_a]:(((sup_sup_set_a @ (insert_a @ X1251 @ X1252) @ X1253)=(insert_a @ X1251 @ (sup_sup_set_a @ X1252 @ X1253)))), inference(variable_rename,[status(thm)],[fact_173_Un__insert__left])). 2.63/2.87 thf(c_0_44, plain, ![X1298:set_a]:(((sup_sup_set_a @ bot_bot_set_a @ X1298)=(X1298))), inference(variable_rename,[status(thm)],[fact_195_sup__bot__left])). 2.63/2.87 thf(c_0_45, plain, ![X3:set_a, X2:set_a]:(((finite_finite_a @ X3)|~((finite_finite_a @ X2))|~((ord_less_eq_set_a @ X3 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_35])). 2.63/2.87 thf(c_0_46, plain, ![X1:a, X2:set_a, X3:set_a]:(((ord_less_eq_set_a @ X2 @ (insert_a @ X1 @ X3))|~((ord_less_eq_set_a @ X2 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_36])). 2.63/2.87 thf(c_0_47, hypothesis, ((esk3_1 @ f)=(f)), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37, c_0_38]), c_0_31])]), c_0_32])). 2.63/2.87 thf(c_0_48, plain, ![X1:a, X2:set_a, X3:set_a]:(~((member_a @ X1 @ (minus_minus_set_a @ X2 @ (insert_a @ X1 @ X3))))), inference(spm,[status(thm)],[c_0_39, c_0_40])). 2.63/2.87 thf(c_0_49, plain, ![X2:set_a, X3:set_a]:(((sup_sup_set_a @ X2 @ (minus_minus_set_a @ X3 @ X2))=(sup_sup_set_a @ X2 @ X3))), inference(split_conjunct,[status(thm)],[c_0_41])). 2.63/2.87 thf(c_0_50, plain, ![X3:set_a, X2:set_a, X1:a]:(((minus_minus_set_a @ X2 @ (insert_a @ X1 @ X3))=(minus_minus_set_a @ (minus_minus_set_a @ X2 @ X3) @ (insert_a @ X1 @ bot_bot_set_a)))), inference(split_conjunct,[status(thm)],[c_0_42])). 2.63/2.87 thf(c_0_51, plain, ![X1:a, X2:set_a, X3:set_a]:(((sup_sup_set_a @ (insert_a @ X1 @ X2) @ X3)=(insert_a @ X1 @ (sup_sup_set_a @ X2 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_43])). 2.63/2.87 thf(c_0_52, plain, ![X2:set_a]:(((sup_sup_set_a @ bot_bot_set_a @ X2)=(X2))), inference(split_conjunct,[status(thm)],[c_0_44])). 2.63/2.87 thf(c_0_53, plain, ![X1:a, X2:set_a, X3:set_a]:(((finite_finite_a @ X2)|~((finite_finite_a @ (insert_a @ X1 @ X3)))|~((ord_less_eq_set_a @ X2 @ X3)))), inference(spm,[status(thm)],[c_0_45, c_0_46])). 2.63/2.87 thf(c_0_54, hypothesis, ((insert_a @ (esk4_1 @ f) @ f)=(f)), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_47]), c_0_31])]), c_0_32])). 2.63/2.87 thf(c_0_55, plain, ![X1021:set_a, X1022:set_a]:((ord_less_eq_set_a @ (minus_minus_set_a @ X1021 @ X1022) @ X1021)), inference(variable_rename,[status(thm)],[fact_82_Diff__subset])). 2.63/2.87 thf(c_0_56, hypothesis, ![X1:a, X2:set_a, X3:set_a]:((((insert_a @ X1 @ (minus_minus_set_a @ X2 @ (insert_a @ X1 @ X3)))!=(f))|~((finite_finite_a @ (minus_minus_set_a @ X2 @ (insert_a @ X1 @ X3)))))), inference(spm,[status(thm)],[c_0_48, c_0_25])). 2.63/2.87 thf(c_0_57, plain, ![X1:a, X2:set_a, X3:set_a]:(((insert_a @ X1 @ (minus_minus_set_a @ X2 @ (insert_a @ X1 @ X3)))=(insert_a @ X1 @ (minus_minus_set_a @ X2 @ X3)))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49, c_0_50]), c_0_51]), c_0_52]), c_0_51]), c_0_52])). 2.63/2.87 thf(c_0_58, hypothesis, ![X2:set_a]:(((finite_finite_a @ X2)|~((ord_less_eq_set_a @ X2 @ f)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53, c_0_54]), c_0_31])])). 2.63/2.87 thf(c_0_59, plain, ![X3:set_a, X2:set_a]:((ord_less_eq_set_a @ (minus_minus_set_a @ X2 @ X3) @ X2)), inference(split_conjunct,[status(thm)],[c_0_55])). 2.63/2.87 thf(c_0_60, hypothesis, ![X1:a, X2:set_a, X3:set_a]:((((insert_a @ X1 @ (minus_minus_set_a @ X2 @ X3))!=(f))|~((finite_finite_a @ (minus_minus_set_a @ X2 @ (insert_a @ X1 @ X3)))))), inference(rw,[status(thm)],[c_0_56, c_0_57])). 2.63/2.87 thf(c_0_61, hypothesis, ![X2:set_a]:((finite_finite_a @ (minus_minus_set_a @ f @ X2))), inference(spm,[status(thm)],[c_0_58, c_0_59])). 2.63/2.87 thf(c_0_62, plain, ![X958:set_a]:(((minus_minus_set_a @ X958 @ bot_bot_set_a)=(X958))), inference(variable_rename,[status(thm)],[fact_59_Diff__empty])). 2.63/2.87 thf(c_0_63, hypothesis, ![X1:a, X2:set_a]:(((insert_a @ X1 @ (minus_minus_set_a @ f @ X2))!=(f))), inference(spm,[status(thm)],[c_0_60, c_0_61])). 2.63/2.87 thf(c_0_64, plain, ![X2:set_a]:(((minus_minus_set_a @ X2 @ bot_bot_set_a)=(X2))), inference(split_conjunct,[status(thm)],[c_0_62])). 2.63/2.87 thf(c_0_65, hypothesis, ![X1:a]:(((insert_a @ X1 @ f)!=(f))), inference(spm,[status(thm)],[c_0_63, c_0_64])). 2.63/2.87 thf(c_0_66, hypothesis, ($false), inference(sr,[status(thm)],[c_0_54, c_0_65]), ['proof']). 2.63/2.87 # SZS output end CNFRefutation 2.63/2.87 # Parsed axioms : 278 2.63/2.87 # Removed by relevancy pruning/SinE : 0 2.63/2.87 # Initial clauses : 476 2.63/2.87 # Removed in clause preprocessing : 45 2.63/2.87 # Initial clauses in saturation : 431 2.63/2.87 # Processed clauses : 4235 2.63/2.87 # ...of these trivial : 66 2.63/2.87 # ...subsumed : 2039 2.63/2.87 # ...remaining for further processing : 2130 2.63/2.87 # Other redundant clauses eliminated : 1651 2.63/2.87 # Clauses deleted for lack of memory : 0 2.63/2.87 # Backward-subsumed : 6 2.63/2.87 # Backward-rewritten : 15 2.63/2.87 # Generated clauses : 173201 2.63/2.87 # ...of the previous two non-redundant : 153886 2.63/2.87 # ...aggressively subsumed : 0 2.63/2.87 # Contextual simplify-reflections : 39 2.63/2.87 # Paramodulations : 171433 2.63/2.87 # Factorizations : 8 2.63/2.87 # NegExts : 4 2.63/2.87 # Equation resolutions : 1670 2.63/2.87 # Propositional unsat checks : 0 2.63/2.87 # Propositional check models : 0 2.63/2.87 # Propositional check unsatisfiable : 0 2.63/2.87 # Propositional clauses : 0 2.63/2.87 # Propositional clauses after purity: 0 2.63/2.87 # Propositional unsat core size : 0 2.63/2.87 # Propositional preprocessing time : 0.000 2.63/2.87 # Propositional encoding time : 0.000 2.63/2.87 # Propositional solver time : 0.000 2.63/2.87 # Success case prop preproc time : 0.000 2.63/2.87 # Success case prop encoding time : 0.000 2.63/2.87 # Success case prop solver time : 0.000 2.63/2.87 # Current number of processed clauses : 1730 2.63/2.87 # Positive orientable unit clauses : 157 2.63/2.87 # Positive unorientable unit clauses: 2 2.63/2.87 # Negative unit clauses : 28 2.63/2.87 # Non-unit-clauses : 1543 2.63/2.87 # Current number of unprocessed clauses: 150270 2.63/2.87 # ...number of literals in the above : 573971 2.63/2.87 # Current number of archived formulas : 0 2.63/2.87 # Current number of archived clauses : 350 2.63/2.87 # Clause-clause subsumption calls (NU) : 373741 2.63/2.87 # Rec. Clause-clause subsumption calls : 181473 2.63/2.87 # Non-unit clause-clause subsumptions : 1089 2.63/2.87 # Unit Clause-clause subsumption calls : 2262 2.63/2.87 # Rewrite failures with RHS unbound : 0 2.63/2.87 # BW rewrite match attempts : 97 2.63/2.87 # BW rewrite match successes : 20 2.63/2.87 # Condensation attempts : 4236 2.63/2.87 # Condensation successes : 32 2.63/2.87 # Termbank termtop insertions : 2209763 2.63/2.87 2.63/2.87 # ------------------------------------------------- 2.63/2.87 # User time : 2.252 s 2.63/2.87 # System time : 0.088 s 2.63/2.87 # Total time : 2.341 s 2.63/2.87 # Maximum resident set size: 3684 pages 2.63/2.87 2.63/2.87 # ------------------------------------------------- 2.63/2.87 # User time : 2.263 s 2.63/2.87 # System time : 0.089 s 2.63/2.87 # Total time : 2.351 s 2.63/2.87 # Maximum resident set size: 2072 pages 2.63/2.87 EOF